- aperiodic task
- апериодическая задачазадача, запускаемая на исполнение через нерегулярные интервалы временисм. тж. task
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.
aperiodic task
Смотреть что такое "aperiodic task" в других словарях:
Quasicrystal — Atomic model of an aluminum palladium manganese (Al Pd Mn) quasicrystal surface. Similar to Fig. 6 in Ref.[1] A quasiperiodic crystal, or, in short, quasicrystal, is a structure that is ordered but not periodic. A quasicrystalline pattern can… … Wikipedia
Markov chain — A simple two state Markov chain. A Markov chain, named for Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized … Wikipedia
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
Dynaco — Founded by David Hafler and Ed Laurent in Philadelphia, Pennsylvania in 1955, Dynaco was an American hi fi audio system manufacturer popular in the 1960s and 1970s for its wide range of affordable, yet high quality audio components..[1] Contents… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Noam Chomsky — Chomsky redirects here. For other topics with the same name, see Chomsky (disambiguation). Noam Chomsky Noam Chomsky visiting Vancouver, Canada in 2004 … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Cryptanalysis — Close up of the rotors in a Fialka cipher machine Cryptanalysis (from the Greek kryptós, hidden , and analýein, to loosen or to untie ) is the study of methods for obtaining the meaning of encrypted information, without access to the secret… … Wikipedia
Polyomino — The 18 one sided pentominoes, including 6 mirrored pairs … Wikipedia
Real time database — A real time database is a processing system designed to handle workloads whose state is constantly changing (Buchmann). This differs from traditional databases containing persistent data, mostly unaffected by time. For example, a stock market… … Wikipedia
Deterministic context-free grammar — In formal grammar theory, the deterministic context free grammars (DCFGs) are a proper subset of the context free grammars. The deterministic context free grammars are those a deterministic pushdown automaton can recognize. A DCFG is the finite… … Wikipedia
